/*
2021-11-8
https://ac.nowcoder.com/acm/contest/22551/F
*/
#include<iostream>

using namespace std;
const int N = 1e5 + 10;
int p[N];

int find(int x)
{
    if (x != p[x]) p[x] = find(p[x]);
    return p[x];
}

int main()
{
    int n, m, a, b;
    char op[2];
    cin >> n >> m;
    for (int i = 1; i <= n; i++) p[i] = i;

    for (int i = 1; i <= m; i++)
    {
        cin >> op >> a >> b;
        if (op[0] == 'M') p[find(a)] = find(b);
        else
        {
            if (find(a) == find(b)) cout << "Yes" << endl;
            else cout << "No" << endl;
        }
    }
    return 0;
}